Achieve Fairness in Rational Secret Sharing Protocol
نویسندگان
چکیده
منابع مشابه
Collusion Free Protocol for Rational Secret Sharing
We consider the rational secret sharing problem introduced by Halpern and Teague[1], where players prefer to get the secret rather than not to get the secret and with lower preference, prefer that as few of the other players get the secret. Some positive results have been derived by Kol and Naor[3] by considering that players only prefer to learn. They have proposed an efficient m-out-of-n prot...
متن کاملPurely Rational Secret Sharing
Rational secret sharing is a fundamental primitive at the intersection of cryptography and game theory. In essence, a dealer wishes to engineer a communication game that, when rationally played, guarantees that each of the players learns the dealer’s secret. Yet, all solutions so far were quite inefficient and relied on the players’ beliefs and not just on their rationality. After providing a m...
متن کاملRational Secret Sharing, Revisited
We consider the problem of secret sharing among n rational players. This problem was introduced by Halpern and Teague (STOC 2004), who claim that a solution is impossible for n = 2 but show a solution for the case n ≥ 3. Contrary to their claim, we show a protocol for rational secret sharing among n = 2 players; our protocol extends to the case n ≥ 3, where it is simpler than the Halpern-Teague...
متن کاملRational Multi-Secret Sharing Scheme Based On Bit Commitment Protocol
In this paper we mainly focus on the fraud problem among the players and the shortcomings of multisecret sharing existed in rational secret sharing schemes. Based on the exited schemes and the related knowledge such as bit commitment agreement, we proposed a new rational multi-secret sharing scheme that has high security. In our scheme, we take an identity authentication for the dealer in distr...
متن کاملRational Secret Sharing without Broadcast
We use the concept of rational secret sharing, which was initially introduced by Halpern and Teague [2], where players’ preferences are that they prefer to learn the secret than not, and moreover they prefer that as few others learn the secret as possible. This paper is an attempt to introduce a rational secret sharing scheme which defers from previous RSS schemes in that this scheme does not r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Security and Its Applications
سال: 2015
ISSN: 1738-9976,1738-9976
DOI: 10.14257/ijsia.2015.9.11.02